Edge-Weighted Centroidal Voronoi Tessellations
نویسندگان
چکیده
Most existing applications of centroidal Voronoi tessellations (CVTs) lack consideration of the length of the cluster boundaries. In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy — a sum of the classic CVT energy and the weighted length of cluster boundaries. To distinguish it with the classic CVTs, we call it an Edge-Weighted CVT (EWCVT). The concept of EWCVT is expected to build a mathematical base for all CVT related data classifications with requirement of smoothness of the cluster boundaries. The EWCVT method is easy in implementation, fast in computation, and natural for any number of clusters. AMS subject classifications: 52B55
منابع مشابه
Constrained Centroidal Voronoi Tessellations for Surfaces
Abstract. Centroidal Voronoi tessellations are useful for subdividing a region in Euclidean space into Voronoi regions whose generators are also the centers of mass, with respect to a prescribed density function, of the regions. Their extensions to general spaces and sets are also available; for example, tessellations of surfaces in a Euclidean space may be considered. In this paper, a precise ...
متن کامل2D Centroidal Voronoi Tessellations with Constraints
We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation. We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the constrained Delaunay edges. The clipping itself i...
متن کاملParallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations
A new algorithm, featuring overlapping domain decompositions, for the parallel construction of Delaunay and Voronoi tessellations is developed. Overlapping allows for the seamless stitching of the partial pieces of the global Delaunay tessellations constructed by individual processors. The algorithm is then modified, by the addition of stereographic projections, to handle the parallel construct...
متن کاملCentroidal Voronoi Tessellations: Applications and Algorithms
A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods f...
متن کاملCentroidal Voronoi Tessellations : Applications and Algorithms ∗ Qiang Du
A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the corresponding Voronoi regions. We give some applications of such tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals. We discuss methods f...
متن کامل